Molecular replacement by evolutionary search
نویسندگان
چکیده
منابع مشابه
Molecular replacement by evolutionary search.
Stochastic search algorithms can be used to perform rapid six-dimensional molecular-replacement searches. A molecular-replacement procedure has been developed that uses an evolutionary algorithm to simultaneously optimize the orientation and position of a search model in a unit cell. Here, the performance of this algorithm and its dependence on search model quality and choice of target function...
متن کاملRapid automated molecular replacement by evolutionary search.
A new procedure for molecular replacement is presented in which an efficient six-dimensional search is carried out using an evolutionary optimization algorithm. In this procedure, a population of initially random molecular-replacement solutions is iteratively optimized with respect to the correlation coefficient between observed and calculated structure factors. The sensitivity and reliability ...
متن کاملAutomating the search of molecular motor templates by evolutionary methods
Biological molecular motors are nanoscale devices capable of transforming chemical energy into mechanical work, which are being researched in many scientific disciplines. From a computational point of view, the characteristics and dynamics of these motors are studied at multiple time scales, ranging from very detailed and complex molecular dynamics simulations spanning a few microseconds, to ex...
متن کاملAdversarial Search by Evolutionary Computation
In this paper, we consider the problem of finding good next moves in two-player games. Traditional search algorithms, such as minimax and alpha-beta pruning, suffer great temporal and spatial expansion when exploring deeply into search trees to find better next moves. The evolution of genetic algorithms with the ability to find global or near global optima in limited time seems promising, but t...
متن کاملAdaptive Search by Evolutionary Algorithms
Evolution Strategies (ESs) and Genetic Algorithms (GAs) are compared in a formal way. It is shown, that both algorithms are identical with respect to their major working scheme, but nevertheless they exhibit signiicant diierences with respect to the details of the selection scheme, the amount of the genetic representation and, especially, the self-adaptation of strategy parameters.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Crystallographica Section D Biological Crystallography
سال: 2001
ISSN: 0907-4449
DOI: 10.1107/s0907444901012458